Robust clustering tools based on optimal transportation
نویسندگان
چکیده
منابع مشابه
Optimal Transportation on the Hemisphere
In this paper, we study the optimal transportation on the hemisphere, with the cost function c(x, y) = 1 2 d(x, y), where d is the Riemannian distance of the round sphere. The potential function satisfies a Monge-Ampère type equation with natural boundary condition. We obtain the a priori oblique estimate without using any uniform convexity of domains, and in particular for two dimensional case...
متن کاملGravity Model for Transportation Network Based on Optimal Expected Traffic
We propose a spatial network model for transportation system based on the optimal expected traffic. The expected traffic represents the prediction of the flow created by two vertices and is calculated by the improved gravity equation wij = K M i M α j D γ ij . The model maximizes the total expected traffic of the network. By changing the two parameters α and γ which controls the fitness and the...
متن کاملRobust Synchronization-Based Graph Clustering
Complex graph data now arises in various fields like social networks, protein-protein interaction networks, ecosystems, etc. To reveal the underlying patterns in graphs, an important task is to partition them into several meaningful clusters. The question is: how can we find the natural partitions of a complex graph which truly reflect the intrinsic patterns? In this paper, we propose RSGC, a n...
متن کاملRobust path-based spectral clustering
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. However, they are not robust enough against noise and outliers in the data. In this paper, based on M-estimation from robust statistics, we develop a robust path-based spectral clustering method by defining a robust pa...
متن کاملA Clustering Based Location-allocation Problem Considering Transportation Costs and Statistical Properties (RESEARCH NOTE)
Cluster analysis is a useful technique in multivariate statistical analysis. Different types of hierarchical cluster analysis and K-means have been used for data analysis in previous studies. However, the K-means algorithm can be improved using some metaheuristics algorithms. In this study, we propose simulated annealing based algorithm for K-means in the clustering analysis which we refer it a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2018
ISSN: 0960-3174,1573-1375
DOI: 10.1007/s11222-018-9800-z